package tree;

import java.util.Iterator;

public class TreeLeaf implements Node {

	int winner;
	int index;
	
	public TreeLeaf(int winner, int index) {
		this.winner = winner;
		this.index = index;
	}
	
	public int winner() {
		return winner;
	}
	
	public int getIndex() {
		return index;
	}
	
	public Iterator<Node> iterator() {
		return new
			Iterator<Node>()
			{
				public boolean hasNext() {
					return false;
				}
				
				public Node next() {
					return null;
				}
				
				public void remove() {}
			};
	}
}
